Variant Extensions to Prove MAS Behaviours
Identifieur interne : 000D67 ( France/Analysis ); précédent : 000D66; suivant : 000D68Variant Extensions to Prove MAS Behaviours
Auteurs : Bruno Mermet [France] ; Dominique Fournier [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2004.
Abstract
Abstract: In this article, it is shown how the behaviour of a multi-agent system can be validated thanks to proof. At first, the method used is briefly presented [10]. Then, the variant notion is presented and an extension of this notion to prove MAS is introduced. In the third part, the proof technique is illustrated for the prey-predator problem: the behaviour of the predators can be induced from the failures in the proof process.
Url:
DOI: 10.1007/978-3-540-30106-6_42
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000893
- to stream Istex, to step Curation: 000893
- to stream Istex, to step Checkpoint: 000584
- to stream Main, to step Merge: 001374
- to stream Main, to step Curation: 001342
- to stream Main, to step Exploration: 001342
- to stream France, to step Extraction: 000D67
Links to Exploration step
ISTEX:447B39F4E260891CA7E603739BB52E57FB75F457Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Variant Extensions to Prove MAS Behaviours</title><author><name sortKey="Mermet, Bruno" sort="Mermet, Bruno" uniqKey="Mermet B" first="Bruno" last="Mermet">Bruno Mermet</name></author><author><name sortKey="Fournier, Dominique" sort="Fournier, Dominique" uniqKey="Fournier D" first="Dominique" last="Fournier">Dominique Fournier</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:447B39F4E260891CA7E603739BB52E57FB75F457</idno><date when="2004" year="2004">2004</date><idno type="doi">10.1007/978-3-540-30106-6_42</idno><idno type="url">https://api.istex.fr/document/447B39F4E260891CA7E603739BB52E57FB75F457/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000893</idno><idno type="wicri:Area/Istex/Curation">000893</idno><idno type="wicri:Area/Istex/Checkpoint">000584</idno><idno type="wicri:doubleKey">0302-9743:2004:Mermet B:variant:extensions:to</idno><idno type="wicri:Area/Main/Merge">001374</idno><idno type="wicri:Area/Main/Curation">001342</idno><idno type="wicri:Area/Main/Exploration">001342</idno><idno type="wicri:Area/France/Extraction">000D67</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Variant Extensions to Prove MAS Behaviours</title><author><name sortKey="Mermet, Bruno" sort="Mermet, Bruno" uniqKey="Mermet B" first="Bruno" last="Mermet">Bruno Mermet</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Fournier, Dominique" sort="Fournier, Dominique" uniqKey="Fournier D" first="Dominique" last="Fournier">Dominique Fournier</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2004</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">447B39F4E260891CA7E603739BB52E57FB75F457</idno><idno type="DOI">10.1007/978-3-540-30106-6_42</idno><idno type="ChapterID">42</idno><idno type="ChapterID">Chap42</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this article, it is shown how the behaviour of a multi-agent system can be validated thanks to proof. At first, the method used is briefly presented [10]. Then, the variant notion is presented and an extension of this notion to prove MAS is introduced. In the third part, the proof technique is illustrated for the prey-predator problem: the behaviour of the predators can be induced from the failures in the proof process.</div></front></TEI><affiliations><list><country><li>France</li></country></list><tree><country name="France"><noRegion><name sortKey="Mermet, Bruno" sort="Mermet, Bruno" uniqKey="Mermet B" first="Bruno" last="Mermet">Bruno Mermet</name></noRegion><name sortKey="Fournier, Dominique" sort="Fournier, Dominique" uniqKey="Fournier D" first="Dominique" last="Fournier">Dominique Fournier</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/France/explor/LeHavreV1/Data/France/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000D67 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/France/Analysis/biblio.hfd -nk 000D67 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/France
|area= LeHavreV1
|flux= France
|étape= Analysis
|type= RBID
|clé= ISTEX:447B39F4E260891CA7E603739BB52E57FB75F457
|texte= Variant Extensions to Prove MAS Behaviours
}}
| This area was generated with Dilib version V0.6.25. |  |